Validated Bounds on Basis Vectors for the Null Space of a Full Rank Rectangular Matrix
نویسنده
چکیده
An orthogonal basis for the null space of a rectangular m by n matrix, with m < n, is required in various contexts, and numerous well-known techniques, such as QR factorizations or singular value decompositions, are effective at obtaining numerical approximations to such a basis. However, validated bounds on the components of each of these null space basis vectors are sometimes required. In this note, we present a simple method for reliably computing such bounds, given an approximation to the null space. We have implemented the method, illustrating its practicality.
منابع مشابه
An alternative Kalman-Yakubovich-Popov lemma and some extensions
This paper introduces an alternative formulation of the Kalman–Yakubovich–Popov (KYP) Lemma, relating an infinite dimensional Frequency Domain Inequality (FDI) to a pair of finite dimensional Linear Matrix Inequalities (LMI). It is shown that this new formulation encompasses previous generalizations of the KYP Lemma which hold in the case the coefficient matrix of the FDI does not depend on fre...
متن کاملAn Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices
In this paper we present an efficient algorithm for computing a sparse null space basis for a full row rank matrix. We first apply the ideas of the Markowitz’s pivot selection criterion to a rank reducing algorithm to propose an efficient algorithm for computing sparse null space bases of full row rank matrices. We then describe how we can use the Dulmage-Mendelsohn decomposition to make the re...
متن کاملHigher rank numerical ranges of rectangular matrix polynomials
In this paper, the notion of rank-k numerical range of rectangular complex matrix polynomials are introduced. Some algebraic and geometrical properties are investigated. Moreover, for ϵ > 0; the notion of Birkhoff-James approximate orthogonality sets for ϵ-higher rank numerical ranges of rectangular matrix polynomials is also introduced and studied. The proposed denitions yield a natural genera...
متن کاملA Novel Noise Reduction Method Based on Subspace Division
This article presents a new subspace-based technique for reducing the noise of signals in time-series. In the proposed approach, the signal is initially represented as a data matrix. Then using Singular Value Decomposition (SVD), noisy data matrix is divided into signal subspace and noise subspace. In this subspace division, each derivative of the singular values with respect to rank order is u...
متن کاملA Novel Noise Reduction Method Based on Subspace Division
This article presents a new subspace-based technique for reducing the noise of signals in time-series. In the proposed approach, the signal is initially represented as a data matrix. Then using Singular Value Decomposition (SVD), noisy data matrix is divided into signal subspace and noise subspace. In this subspace division, each derivative of the singular values with respect to rank order is u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005